On the solitaire cone and its relationship to multi-commodity flows
نویسندگان
چکیده
The classical game of Peg Solitaire has uncertain origins, but was certainly popular by the time of LOUIS XIV, and was described by LEIBNIZ in 1710. The modern mathematical study of the game dates to the 1960s, when the solitaire cone was first described by BOARDMAN and CONWAY. Valid inequalities over this cone, known as pagoda functions, were used to show the infeasibility of various peg games. In this paper we study the extremal structure of solitaire cones for a variety of boards, and relate their structure to the well studied metric cone. In particular we give: 1. an equivalence between the multicommodity flow problem with associated dual metric cone and a generalized peg game with associated solitaire cone; 2. a related NP-completeness result; 3. a method of generating large classes of facets; 4. a complete characterization of 0-1 facets; 5. exponential upper and lower bounds (in the dimension) on the number of facets; 6. results on the number of facets, incidence and adjacency relationships and diameter for small rectangular, toric and triangular boards; 7. a complete characterization of the adjacency of extreme rays, diameter, number of 2-faces and edge connectivity for rectangular toric boards.
منابع مشابه
Multi-commodity Multimodal Splittable Logistics Hub Location Problem with Stochastic Demands
This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...
متن کاملThree-dimensional characteristic approach for incompressible thermo-flows and influence of artificial compressibility parameter
In this paper the characteristics of unsteady three-dimensional incompressible flows with heat transfer are obtained along with artificial compressibility of Chorin. At first, compatibility equations and pseudo characteristics for three-dimensional flows are derived from five governing equations (continuity equation, Momentum equations in three directions, and energy equation) and then results ...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملOn the k-Splittable Flow Problem
In traditional multi-commodity flow theory, the task is to send a certain amount of each commodity from its start to its target node, subject to capacity constraints on the edges. However, no restriction is imposed on the number of paths used for delivering each commodity; it is thus feasible to spread the flow over a large number of different paths. Motivated by routing problems arising in rea...
متن کاملModel and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 90 شماره
صفحات -
تاریخ انتشار 2001